[20250614] BOJ / G4 / N-Queen / 설진영 #354
Merged
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Seol-JY
changed the title
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
🧷 문제 링크
https://www.acmicpc.net/problem/9663
🧭 풀이 시간
30분
👀 체감 난이도
✏️ 문제 설명
전형적인 N-Queen 문제
🔍 풀이 방법
대각선에 있는 칸들은 row 와 col에 대한 특정 연산 결과가 동일하다는 점을 이용해서 세번의 연산으로 Queen을 둘 수 있는지 판단하도록 했음
⏳ 회고
쉬운문제라 일부러 어렵게 풀어봄